The shorter queue polling model
نویسندگان
چکیده
We consider a two-queue polling model in which customers upon arrival join the shorter of two queues. Customers arrive according to a Poisson process and the service times in both queues are independent and identically distributed random variables having the exponential distribution. The two-dimensional process of the numbers of customers at the queue where the server is and at the other queue is a two-dimensional Markov process. We derive its equilibrium distribution using two methodologies: the compensation approach and a reduction to a boundary value problem.
منابع مشابه
A polling model with an autonomous server
Polling models are used as an analytical performance tool in several application areas. In these models, the focus often is on controlling the operation of the server as to optimize some performance measure. For several applications, controlling the server is not an issue as the server moves independently in the system. We present the analysis for such a polling model with a so-called autonomou...
متن کاملFeature Analysis on Queue Length of Asymmetric Two-queue Polling System with Gated Services
On the basis of establishing mathematical model and defining the parameters and treating embedded Markov chains and probability generating function as math tools, the paper analyzed discrete-time, nonsymmetric dual-threshold service queue system precisely, and it derived first order and second order characteristics of the system. The paper calculates the average queue length and average waiting...
متن کاملIterative approximation of limited polling systems
The present paper deals with the problem of calculating queue length distributions in a polling model with (exhaustive) limited service under the assumption of general arrival, service and setup distributions. The interest for this model is fueled by an application in the field of logistics. Knowledge of the queue length distributions is needed to operate the system properly. The multi-queue po...
متن کاملResponse-time Approximations for Multi-server, Multi-class Production Systems with Significant Setups
A multi-server polling model is a queueing model where many order classes share a set of identical servers and a setup time is incurred whenever a server changes class. This paper develops approximations for the waiting time distribution in a multi-server polling model with cyclic serve-to-exhaustion service. These approximations are derived using previously established heavy-traac results and ...
متن کاملA two-queue polling model with two priority levels in the first queue
In this paper we consider a single-server cyclic polling system consisting of two queues. Between visits to successive queues, the server is delayed by a random switch-over time. Two types of customers arrive at the first queue: high and low priority customers. For this situation the following service disciplines are considered: gated, globally gated, and exhaustive. We study the cycle time dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Annals OR
دوره 241 شماره
صفحات -
تاریخ انتشار 2016